Decomposing plane cubic graphs
نویسندگان
چکیده
It was conjectured by Hoffmann-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. We prove the conjecture for 3-connected cubic plane graphs and 3-connected cubic graphs on the projective plane. Our proof provides a polynomial time algorithm to find the decomposition for 3-connected cubic plane graphs.
منابع مشابه
Decomposing Cubic Graphs into Connected Subgraphs of Size Three
Let S = {K1,3,K3, P4} be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph G into graphs taken from any non-empty S′ ⊆ S. The problem is known to be NP-complete for any possible choice of S′ in general graphs. In this paper, we assume that the input graph is cubic, and study the computational complexity of the problem of partitioning its edge se...
متن کاملForcing faces in plane bipartite graphs
Let denote the class of connected plane bipartite graphs with no pendant edges. A finite face s of a graphG ∈ is said to be a forcing face ofG if the subgraph ofG obtained by deleting all vertices of s together with their incident edges has exactly one perfect matching. This is a natural generalization of the concept of forcing hexagons in a hexagonal system introduced in Che and Chen [Forcing ...
متن کاملSymmetric Cubic Graphs of Girth at Most 7
By a symmetric graph we mean a graph X which automorphism group acts transitively on the arcs of X. A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Tutte [31, 32] showed that every finite symmetric cubic graph is s-regular for some s ≤ 5. It is well-known that there are precisely five symmetric cubic graphs of girth less than 6. All these graphs can be re...
متن کاملReally Straight Graph Drawings
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes, and that every cubic 3-connected plane graph has a plane drawing with ...
متن کاملRecursive formulas for embedding distributions of cubic outerplanar graphs
Recently, the first author and his coauthor proved a k-order homogeneous linear recursion for the genus polynomials of any H-linear family of graphs (called path-like graph families by Mohar). Cubic outerplanar graphs are tree-like graph families. In this paper, we derive a recursive formula for the total embedding distribution of any cubic outerplanar graph. We also obtain explicit formulas fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 52 شماره
صفحات -
تاریخ انتشار 2016